Lambda definability is decidable for regular forth order types

نویسنده

  • Marek Zaionc
چکیده

It has been proved by Loader [2] that Statman-Plotkin conjecture (see [5] and [4]) fails. The Loader proof was done by encoding the word problem in the full type hierarchy based on the domain with 7 elements. Later Loader refined the result by establishing that the problem is undecidable for every finite domain with 3 ground elements [3]. The remaining non trivial case with 2 ground elements has been shown to be undecidable by Thierry Joly (2003) in [1]. The aim of this note is to show that the lambda definability problem limited for regular forth order types is decidable in any finite domain. Obviously λ definability is decidable for 1,2 and 3 order types in any finite domain. As an additional effect of the result described we may observe that for certain types there is no finite context free grammar generating all closed terms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic Approach to the Lambda Definability for Fourth Order Types

It has been proved by Loader [3] that Statman-Plotkin conjecture (see [7] and [5]) fails. The Loader proof was done by encoding the word problem in the full type hierarchy based on the domain with 7 elements. The aim of this paper is to show that the lambda definability problem limited to regular fourth order types is decidable in any finite domain. Obviously λ definability is decidable for 1, ...

متن کامل

Characterizing Definability in Decidable Fixpoint Logics

We look at characterizing which formulas are expressible in rich decidable logics such as guarded fixpoint logic, unary negation fixpoint logic, and guarded negation fixpoint logic. We consider semantic characterizations of definability, as well as effective characterizations. Our algorithms revolve around a finer analysis of the tree-model property and a refinement of the method of moving back...

متن کامل

Asymptotic Densities in Logic and Type Theory

This paper presents a systematic approach for obtaining results from the area of quantitative investigations in logic and type theory. We investigate the proportion between tautologies (inhabited types) of a given length n against the number of all formulas (types) of length n. We investigate an asymptotic behavior of this fraction. Furthermore, we characterize the relation between number of pr...

متن کامل

Lambda Deenability Is Decidable for Second Order Types and for Regular Third Order Types

It has been proved by Loader 1] that Statman-Plotkin conjecture (see 4] and 2]) fails. The Loader proof was done by encoding the word problem in the full type hierarchy based on the domain with 7 elements. The aim of this paper is to show that the lambda deenability problem limited for second order types and regular third order types is decidable in any nite domain. Obviously deenability is dec...

متن کامل

Definability by Weakly Deterministic Regular Expressions with Counters is Decidable

We show that weakly deterministic regular expressions with counters (WDREs) —as they are used in XML Schema— are at most exponentially larger than equivalent DFAs. As a consequence, the problem, whether a given DFA is equivalent to any WDRE, is decidable in EXPSPACE.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004